Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics

نویسندگان

  • Vladimir A. Emelichev
  • Olga V. Karelkina
  • Kirill G. Kuzmin
چکیده

In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data’s perturbations in the space of vector criteria parameters with norms l1 and l∞, preserved Pareto optimality of the solutions is investigated. Formulas of the quasistability radius and of strong quasistability radius of the considered problem are given as corollaries. AMS Mathematics Subject Classification:90C08, 90C10.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

Goal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem

  Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...

متن کامل

A Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times

We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...

متن کامل

A Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain

In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...

متن کامل

A full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The Computer Science Journal of Moldova

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2005